The Honeycomb Conjecture
نویسنده
چکیده
This paper gives a proof of the classical honeycomb conjecture: any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling.
منابع مشابه
On the Application of the Honeycomb Conjecture to the Bee’s Honeycomb∗†
In a recent paper, Aidan Lyon and Mark Colyvan have proposed an explanation of the structure of the bee’s honeycomb based on the mathematical Honeycomb Conjecture. This explanation has instantly become one of the standard examples in the philosophical debate on mathematical explanations of physical phenomena. In this critical note, I argue that the explanation is not scientifically adequate. Th...
متن کاملGeneralized honeycomb torus is Hamiltonian
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a “token ring” parallel algorithm onto the associated network in an efficient way. Cho and Hsu...
متن کاملA numerical adaptation of SAW identities from the honeycomb to other 2D lattices
Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is
متن کاملA short geometric proof of a conjecture of Fulton
We give a new geometric proof of a conjecture of Fulton on the Littlewood-Richardson coefficients. This conjecture was firstly proved by Knutson, Tao and Woodward using the Honeycomb theory. A geometric proof was given by Belkale. Our proof is based on the geometry of Horn’s cones.
متن کاملThe Honeycomb Model of the Berenstein-zelevinsky Polytope I. Klyachko’s Saturation Conjecture
Recently Klyachko [K] has given linear inequalities on triples (λ, μ, ν) of dominant weights of GLn(C) necessary for the the corresponding Littlewood-Richardson coefficient dim(Vλ⊗Vμ⊗Vν) GLn(C) to be positive. We show that these conditions are also sufficient, which was known as the saturation conjecture. In particular this proves Horn’s conjecture from 1962, giving a recursive system of inequa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 25 شماره
صفحات -
تاریخ انتشار 2001